Large Deviations of a Modified Jackson Network : Stability and Rough Asymptotics
نویسنده
چکیده
Consider a modified, stable, two node Jackson network where server 2 helps server 1 when server 2 is idle. The probability of a large deviation of the number of customers at node one can be calculated using the flat boundary theory of Schwartz and Weiss [Large Deviations Performance Analysis (1994), Chapman and Hall, New York]. Surprisingly, however, these calculations show that the proportion of time spent on the boundary, where server 2 is idle, may be zero. This is in sharp contrast to the unmodified Jackson network which spends a nonzero proportion of time on this boundary.
منابع مشابه
Join the Shortest Queue: Stability and Exact Asymptotics
We consider the stability of a network serving a patchwork of overlapping regions where customers from a local region are assigned to a collection of local servers. These customers join the queue of the local server with the shortest queue of waiting customers. We then describe how the backlog in the network overloads. We do this in the simple case of two servers each of which receives a dedica...
متن کاملA new virtual leader-following consensus protocol to internal and string stability analysis of longitudinal platoon of vehicles with generic network topology under communication and parasitic delays
In this paper, a new virtual leader following consensus protocol is introduced to perform the internal and string stability analysis of longitudinal platoon of vehicles under generic network topology. In all previous studies on multi-agent systems with generic network topology, the control parameters are strictly dependent on eigenvalues of network matrices (adjacency or Laplacian). Since some ...
متن کاملAsymptotics of overflow probabilities in Jackson networks
We consider the probability that the total population of a Jackson network exceeds a given large value. By using the relation to the stationary distribution, we derive upper and lower bounds on this probability. These bounds imply a stronger logarithmic limit when multiple nodes have the same maximal load.
متن کاملStochastic processes in random graphs
We study the asymptotics of large, moderate and normal deviations for the connected components of the sparse random graph by the method of stochastic processes. We obtain the logarithmic asymptotics of large deviations of the joint distribution of the number of connected components, of the sizes of the giant components, and of the numbers of the excess edges of the giant components. For the sup...
متن کاملModerate Deviations for Randomly Perturbed Dynamical Systems
A Moderate Deviation Principle is established for random processes arising as small random perturbations of one-dimensional dynamical systems of the form Xn = f(Xn−1). Unlike in the Large Deviations Theory the resulting rate function is independent of the underlying noise distribution, and is always quadratic. This allows one to obtain explicit formulae for the asymptotics of probabilities of t...
متن کامل